An axiomatic semantics for Esterel

An Axiomatic Semantics for Data Parallel Computation

Proof rules for both directly and indirectly indexed data-parallel array assignment are presented. Consequently, the correctness of two programs, (i) a representation of Cannon’s algorithm and (ii) sparse matrix-vector multiplication, are established by application of the rules.

A Deterministic Logical Semantics for Esterel

Esterel is a synchronous design language for the specification of reactive systems. There exist two main semantics for Esterel. On the one hand, the logical behavioral semantics provides a simple and compact formalization of the behavior of programs using SOS rules. But it does not ensure deterministic executions for all programs and all inputs. As non-deterministic programs have to be rejected...

The Semantics of Pure Esterel

We present a survey of the main semantics of Pure Esterel, the communication kernel of the Esterel synchronous reactive language. We start by an informal presentation of the Pure Esterel language. We then present the be-havioral semantics that deenes the language. We deene the notion of a haltset that corresponds to a distributed program counter. Using haltsets, we show that Pure Esterel progra...

An Axiomatic Semantics of Concurrent Programming Languages

Hoare’s Axiomatic Semantics